The Equivalence Between the DHP and DLP for Elliptic Curves Used in Practical Applications, Revisited
نویسنده
چکیده
The theoretical equivalence between the DLP and DHP problems was shown by Maurer in 1994. His work was then reexamined by Muzereau et al. [11] for the special case of elliptic curves used in practical cryptographic applications. This paper improves on the latter and tries to get the tightest possible reduction in terms of computational equivalence, using Maurer’s method.
منابع مشابه
Improved Lower Bound on DHP: Towards the Equivalence of DHP and DLP for Important Elliptic Curves Used for Implementation
In 2004, Muzereau et al. showed how to use a reduction algorithm of the discrete logarithm problem to DiffieHellman problem in order to estimate lower bound on Diffie-Hellman problem on elliptic curves. They presented their estimates for various elliptic curves that are used in practical applications. In this paper, we show that a much tighter lower bound for Diffie-Hellman problem on those cur...
متن کاملOn the Static Diffie-Hellman Problem on Elliptic Curves over Extension Fields
We show that for any elliptic curve E(Fqn), if an adversary has access to a Static Diffie-Hellman Problem (Static DHP) oracle, then by making O(q 1 n+1 ) Static DHP oracle queries during an initial learning phase, for fixed n > 1 and q →∞ the adversary can solve any further instance of the Static DHP in heuristic time Õ(q 1 n+1 ). Our proposal also solves the Delayed Target DHP as defined by Fr...
متن کاملEfficient elliptic curve cryptosystems
Elliptic curve cryptosystems (ECC) are new generations of public key cryptosystems that have a smaller key size for the same level of security. The exponentiation on elliptic curve is the most important operation in ECC, so when the ECC is put into practice, the major problem is how to enhance the speed of the exponentiation. It is thus of great interest to develop algorithms for exponentiation...
متن کاملOn the Diffie-Hellman problem over GLn
This paper considers the Diffie-Hellman problem (DHP) over the matrix group GLn over finite fields and shows that for matrices A and exponents k, l satisfying certain conditions called the modulus conditions, the problem can be solved without solving the discrete logarithm problem (DLP) involving only polynomial number of operations in n. A specialization of this result to DHP on Fpm shows that...
متن کاملAn Efficient Threshold Verifiable Multi-Secret Sharing Scheme Using Generalized Jacobian of Elliptic Curves
In a (t,n)-threshold secret sharing scheme, a secret s is distributed among n participants such that any group of t or more participants can reconstruct the secret together, but no group of fewer than t participants can do. In this paper, we propose a verifiable (t,n)-threshold multi-secret sharing scheme based on Shao and Cao, and the intractability of the elliptic curve discrete logar...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005